Histogramming on a Reconfigurable Mesh Computer
نویسندگان
چکیده
We develop reconfigurable mesh (RMESH) algorithms for window broadcasting, data shifts, and consecutive sum. These are then used to develop efficient algorithms to compute the histogram of an image and to perform histogram modification. The histogram of an N×N image is computed by an N×N RMESH in O (√ B log√ B (N/√ B ) for B < N, Ο(√ N ) for B = N, and Ο(√ B ) for B > N. B is the number of gray scale values. Histogram modification is done in O (√ N ) time by an N×N RMESH.
منابع مشابه
Enhanced Mesh-Connected Computers for Image Processing Applications - Computer Architectures for Machine Perception, 1995. Proceedings. CAMP '95
The Reconfigurable Array with Spanning Optical Buses ( R A S O B ) has recently been introduced as an efficient enhanced mesh-connected parallel computer. RASOB combines some of the advantage characteristics of reconfigurable meshes and meshes with optical pipelined buses. In this paper, we use this computing model for the efficient design of fundamental image processing applications. In order ...
متن کاملReconfigurable Mesh Algorithms For The Area And Perimeter Of Image Components And Histogramming*
We consider the following image processing problems: compute the area and perimeter of the components of an image, compute the histogram of an image, and histogram modification. Parallel reconfigurable mesh computer algorithms are developed for these problems. The area and perimeter of the components of an N×N image are computed in O (logN) time by an N×N RMESH; the histogram of an N×N image is...
متن کاملOptimal Simulations in Reconfigurable Arrays
There are several reconfiguring models of parallel computation that are considered in the published literature, depending on their switching capabilities. Three of the more popular ones are the Horizontal-Vertical Reconfigurable Mesh (HV-RN model) [LM89a, LM89b, ML89], the Linear Reconfigurable Mesh (LRN model) [MPRS87, BPRS91], and the General Reconfigurable Mesh (RN model) [Wan91, Sch91]. Can...
متن کاملConstant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
The reconfigurable mesh consists of an array of processors interconnected by a reconfigurable bus system. The bus system can be used to dynamically obtain various interconnection patterns among the processors. Recently, this model has attracted a lot of attention. In this paper, we show O(1) time solutions to the following computational geometry problems on the reconfigurable mesh: all-pairs ne...
متن کاملAn improved constant-time algorithm for computing the Radon and Hough transforms on a reconfigurable mesh
The Hough transform is an important problem in image processing and computer vision. Recently, an efficient algorithm for computing the Hough transform has been proposed on a reconfigurable array [12]. For a problem with an p N p N image and an n n parameter space, the algorithm runs in a constant time on a threedimensional (3-D) n n N reconfigurable mesh where the data bus is N1=c-bit wide. To...
متن کامل